A Method for the Computation of Reliability Bounds for Non-repairable Fault-tolerant Systems

نویسندگان

  • Víctor Suñé
  • Juan A. Carrasco
چکیده

A realistic modeling of fault-tolerant systems requires to take into account phenomena such as the dependence of component failure rates and coverage parameters o n the operational configuration of the system, which cannot be properly captured using combinatoric techniques. Such dependencies can be modeled with detail using continuous-time Markov chains (CTMC’s). However, the use of C T M C models is limited by the well-known state space exploition problem. In this paper we develop a method f o r the computation of bounds f o r the reliability of non-repairable faulttolerant systems which requires the generation of only Q subset of states. The tightness of the bounds increases as more detailed states are generated. The method uses the failure distance concept and is illustrated using a n exumple of a quite complex fault-tolerant system whose failure behavior has the above mentioned types of dependencies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A failure-distance based method to bound the reliability of nonrepairable fault-tolerant systems without the knowledge of minimal cuts

CTMC (continuous-time Markov chains) are a commonly used formalism for modeling fault-tolerant systems. One of the major drawbacks of CTMC is the well-known state-space explosion problem. This work develops and analyzes a method (SC-BM) to compute bounds for the reliability of non-repairable fault-tolerant systems in which only a portion of the state space of the CTMC is generated. SC-BM uses t...

متن کامل

Computationally Efficient and Numerically Stable Reliability Bounds for Repairable Fault-Tolerant Systems

ÐThe transient analysis of large continuous time Markov reliability models of repairable fault-tolerant systems is computationally expensive due to model stiffness. In this paper, we develop and analyze a method to compute bounds for a measure defined on a particular, but quite wide, class of continuous time Markov models, encompassing both exact and bounding continuous time Markov reliability ...

متن کامل

Fault Tolerant DNA Computing Based on ‎Digital Microfluidic Biochips

   Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...

متن کامل

Safety-Reliability of Distributed Embedded System Fault Tolerant Units

In this paper we compare the relative performance of two fault tolerant mechanisms dealing with repairable and non-repairable components that have failed. The relative improvement in the reliability and safety of a system with repairable components is calculated with respect to the corresponding system where the components are not repairable. The fault tolerant systems under study correspond to...

متن کامل

Tight Steady-State Availability Bounds Using the Failure Distance Concept

Continuous-time Markov chains are commonly used for dependability modeling of repairable fault-tolerant computer systems. Realistic models of non-trivial fault-tolerant systems often have very large state spaces. An attractive approach for dealing with the largeness problem is the use of pruning methods with error bounds. Several such methods for computing steady-state availability bounds have ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997